0% completed
Problem Statement
You are given an array of integers heights, where heights[i] is the height of the ith building, integer bricks, and integer ladders.
You start traveling from the first building and move to the next building by either using bricks or ladders.
Each time you encounter a building taller than the one you're currently on, you have two options:
- climb up using a
fixed amountof bricks for each unit of height difference - Or, utilize a
ladderto bypass the height difference entirely
Return the index (0-indexed) of the furthest building you can reach if you use the given ladders and bricks optimally.
Examples
Example 1:
- Input:
heights = [4,12,2,7,3,18,20,3,19], bricks = 10, ladders = 2 - Expected Output:
7 - Justification:
- Move from building 0 to 1 using a ladder.
- Move from building 1 to 2 without using any resources.
- Move from building 2 to 3 using 5 bricks.
- Move from building 3 to 4 without using any resources.
- Move from building 4 to 5 using a ladder.
- Move from building 5 to 6 using 2 bricks.
- Move from building 3 to 4 without using any resources.
Example 2:
- Input:
heights = [1,5,1,2,3,4,10000], bricks = 4, ladders = 1 - Expected Output:
5 - Justification: Use the ladder for the large jump from 0 to 1. Use bricks for smaller climbs from 1 to 2, 2 to 3, 3 to 4, and 4 to 5. This strategy gets you to the 5th building before running out of resources.
Example 3:
- Input:
heights = [5,1,1,1,1,1,1,1,1,1,20], bricks = 10, ladders = 1 - Expected Output:
10 - Justification: Use the ladder for the last large climb from 9 to 10 buildings. Bricks can be used for one of the single-unit climbs if necessary, allowing you to reach the last building.
Solution
To solve this problem, we will adopt a greedy strategy that prioritizes the use of ladders for the largest height differences between buildings, ensuring bricks are conserved for smaller gaps. This approach works because ladders can cover any height difference, making them more valuable for larger gaps, whereas bricks are finite and should be used sparingly. We'll manage this by keeping track of the height differences where ladders are used in a min-priority queue structure. When we run out of ladders, we will start replacing the smallest ladder-used gaps with bricks, ensuring we always make the optimal choice for ladder and brick usage.
Our method ensures that we can travel the maximum distance by optimally utilizing the resources at our disposal. It strikes a balance between the use of ladders for significant height differences and bricks for smaller ones. This way, we stretch the utility of our resources and ensure that we can cover as much ground as possible.
Step-by-Step Algorithm
- Initialize a priority queue (min heap)
ladderAllocationsto keep track of the heights differences that have been climbed using ladders. Also, prepare a variableusedBricksto count the number of bricks used. - Iterate through the array of building heights.
- For each pair of adjacent buildings, calculate the height difference
diff(if the next building is taller). - If
diff > 0, attempt to use a ladder by addingdifftoladderAllocations. - If the size of
ladderAllocationsexceeds the number of ladders available, remove the smallest height difference from the priority queue and subtract that value frombricks. - If
bricksvalue is less than 0 at any point, return the current index as the furthest building you can reach.
- For each pair of adjacent buildings, calculate the height difference
- If you can iterate through all buildings without exceeding the available bricks, return the last building's index as the furthest you can reach.
Algorithm Walkthrough
Let's consider the Input: heights = [4,12,2,7,3,18,20,3,19], bricks = 10, and ladders = 2.
- Start with an empty priority queue and 0 used bricks.
- Move from building 0 to 1 (
heights[0]toheights[1]):- Height difference is
12 - 4 = 8. Since it's positive, we consider using resources. - Add
8to the priority queue. Priority queue now contains[8]. - No need to use bricks since the number of ladders exceeds the queue's size.
- Height difference is
- Move from building 1 to 2 (
heights[1]toheights[2]):- Height difference is
2 - 12 = -10. No resources are needed as the next building is shorter.
- Height difference is
- Move from building 2 to 3 (
heights[2]toheights[3]):- Height difference is
7 - 2 = 5. Since it's positive, we consider using resources. - Add
5to the priority queue. Priority queue now contains[5, 8]. - No need to use bricks since the number of ladders exceeds the queue's size.
- Height difference is
- Move from building 3 to 4 (
heights[3]toheights[4]):- Height difference is
3 - 7 = -4. No resources are needed as the next building is shorter.
- Height difference is
- Move from building 4 to 5 (
heights[4]toheights[5]):- Height difference is
18 - 3 = 15. Since it's positive, we consider using resources. - Add
15to the priority queue. Priority queue now contains[5, 8, 15]. - Since the queue's size now exceeds the number of ladders, remove the smallest element (
5) and subtract frombricks.bricksbecomes5. Priority queue now contains[8, 15].
- Height difference is
- Move from building 5 to 6 (
heights[5]toheights[6]):- Height difference is
20 - 18 = 2. Since it's positive, we consider using resources. - Add
2to the priority queue. Priority queue now contains[2, 8, 15]. - Since the queue's size exceeds the number of ladders, remove the smallest element (
2) and subtract frombricks``.bricksbecomes3. Priority queue now contains[8, 15]`.
- Height difference is
- Move from building 6 to 7 (
heights[6]toheights[7]):- Height difference is
3 - 20 = -17. No resources are needed as the next building is shorter.
- Height difference is
- Move from building 7 to 8 (
heights[7]toheights[8]):- Height difference is
19 - 3 = 16. Since it's positive, we consider using resources. - Add
16to the priority queue. Priority queue now contains[8, 15, 16]. - Since the queue's size exceeds the number of ladders, remove the smallest element (
8) and subtract frombricks.bricksbecomes-5, which is less than 0. So, return the current index7.
- Height difference is
- Final Result: You can reach to the 7th (0-based) building using the given resources.
Complexity Analysis
Time Complexity
- Insertion into the Min-Heap: Each insertion operation into the min-heap takes
time, where (m) is the number of elements in the heap. - Iterating through the buildings: The solution iterates through the buildings once, leading to
operations where (n) is the number of buildings. - Heap operations: In the worst case, each building difference could be pushed into and popped from the heap once, leading to
for heap operations since the heap size can grow up to (n - 1).
Overall, the time complexity of the solution is
Space Complexity
- Heap Storage: The min-heap can store up to
differences in height between buildings, leading to a space complexity of . - Auxiliary Space: Constant space is used for variables, leading to
.
Thus, the space complexity of the solution is
On this page
Problem Statement
Examples
Solution
Step-by-Step Algorithm
Algorithm Walkthrough
Complexity Analysis
Time Complexity
Space Complexity